A Fast, Parallel Performance of Fourth Order Iterative Algorithm on Shared Memory Multiprocessors (SMP) Architecture
نویسندگان
چکیده
The rotated fourth order iterative algorithm of O(h4) accuracy applied to linear system arising from the discretization of two dimensional Poisson problem was introduced by Othman, et al., 2001 and it was shown to be the fastest as compared to the standard fourth order iterative algorithm, see Gupta, 1984. While the parallel standard fourth order iterative algorithm was implemented successfully by many researchers for solving a large scientific and engineering problems, see Abdullah and Ali 2000, Yousif and Evans, 1995 and Spotz and Carey, 1999. In this paper, the implementation of the parallel rotated fourth order iterative algorithm on SMP architecture is discussed. The performance results of all the parallel algorithms were compared in order to show their outstanding performances. 1 Department of Communication Technology and Network, University Putra Malaysia 43400 UPM Serdang, Selangor D.E., Malaysia [email protected]
منابع مشابه
PERFORMANCE OF HYBRID OpenMP/MPI PARALLEL PROGRAMMING APPLICATION OF FINITE ELEMENT METHOD
In the area of parallel processing and parallel algorithms several processors are used together to execute a single application faster. There are two major programming paradigms: Shared Memory and Message Passing. Each of them fits into a specific physical model, but there are multiprocessors architectures whose mapping to one of these paradigms is not so simple. SMP clusters, for example, are ...
متن کاملA Comparison of the Performance of List Ranking and Connected Components Algorithms on SMP and MTA Shared-Memory Systems
Irregular problems such as those from graph theory pose serious challenges for parallel machines due to non-contiguous accesses to global data structures with low degrees of locality. Few parallel graph algorithms on distributedor shared-memory machines can outperform their best sequential implementation due to long memory latencies and high synchronization costs. In this paper, we consider the...
متن کاملDecision Tree Construction for Data Mining on Cluster of Shared-Memory Multiprocessors
Classification of very large datasets is a challenging problem in data mining. It is desirable to have decision-tree classifiers that can handle large datasets, because a large dataset often increases the accuracy of the resulting classification model. Classification tree algorithms can benefit from parallelization because of large memory and computation requirements for handling large datasets...
متن کاملParallel Classification for Data Mining on Shared-Memory Multiprocessors
We present parallel algorithms for building decision-tree classifiers on shared-memory multiprocessor (SMP) systems. The proposed algorithms span the gamut of data and task parallelism. The data parallelism is based on attribute scheduling among processors. This basic scheme is extended with task pipelining and dynamic load balancing to yield faster implementations. The task parallel approach u...
متن کاملA New Prediction Oriented Barrier Synchronization on SMP Clusters
Clusters of Symmetric Multiprocessors (CSMP) are becoming an increasingly popular high-performance computing platform due to the commodity availability of multiprocessor nodes, mature SMP operating systems, low-latency, highbandwidth data networks, and superior price-performance ratio. Fast synchronization is crucial to making efficient use of SMP clusters. In this paper, we focus on one kind o...
متن کامل